A symmetric BIBD with trivial automorphism group
نویسندگان
چکیده
منابع مشابه
Simple Non-trivial Designs with an Arbitrary Automorphism Group
For positive integers t; v; k and l satisfying k > t and v > k; a t-design D with parameters ðv; k; lÞ is a set X of v points, together with a collectionB of subsets, called blocks, such that each block contains exactly k points and each t-tuple of points is contained in exactly l blocks. A t ðv; k; lÞ design is simple if repeated blocks are not allowed and is non-trivial if not all k-sets of p...
متن کاملautomorphism group of a possible 2-(115,19,3) symmetric design
let be a set and let be the set of subsets of . the pair in which is a collection of elements of (blocks) is called a design if every element of appears in , times. is called a symmetric design if . in a symmetric design, each element of appears times in blocks of . a mapping between two designs and is an isomorphism if is a one-to-one correspondence and . every isomorphism of a design, , to it...
متن کاملAutomorphism Group of a Possible 2-(121, 16, 2) Symmetric Design
Let D be a symmetric 2-(121, 16, 2) design with the automorphism group of Aut(D). In this paper the order of automorphism of prime order of Aut(D) is studied, and some results are obtained about the number of fixed points of these automorphisms. Also we will show that |Aut(D)|=2p 3q 5r 7s 11t 13u, where p, q, r, s, t and u are non-negative integers such that r, s, t, u ? 1. In addition we prese...
متن کاملDistance Transitive Graphs with Symmetric or Alternating Automorphism Group
for some n , acting primitively on the set of vertices. This forms a part of the programme for the classification of all finite primitive distance transitive graphs begun in [76]; for in [76] this classification is reduced to the determination of all such graphs whose automorphism group G is either almost simple (that is, T o f f S Aut T for some nonabelian simple group T ) or affine (that is, ...
متن کاملA q-DEFORMATION OF A TRIVIAL SYMMETRIC GROUP ACTION
Let A be the arrangement of hyperplanes consisting of the reflecting hyperplanes for the root system An−1. Let B = B(q) be the Varchenko matrix for this arrangement with all hyperplane parameters equal to q. We show that B is the matrix with rows and columns indexed by permutations with σ, τ entry equal to qi(στ −1) where i(π) is the number of inversions of π. Equivalently B is the matrix for l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1985
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90042-1